Reduced Length Checking Sequences
نویسندگان
چکیده
Here, the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines.
منابع مشابه
Generating Checking Sequences for Partial Reduced Finite State Machines
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is proposed for partial reduced FSMs with distinguishing sets, and either with or without reset feature. Sufficient conditions for a sequence to be a checking sequence for such FSMs are formulated. Based on these conditions...
متن کاملAdaptive Design Methods for Checking Sequences
The length of checking sequences for sequential machines can be considerably reduced if, instead of preset distinguishing sequences, one uses so-called "distinguishing sets" of sequences, which serve the same purpose but are generally shorter. The design of such a set turns out to be equivalent to the design of an adaptive distinguishing experiment, * though a checking sequence, using a disting...
متن کاملGeneralizing Redundancy Elimination in Checking Sequences
Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα′ of α′–sequences and a set ET of T–sequences, that both recognize the states, and elements of EC which represents the transitions in the FSM. An optimization algorithm may then be used to produce a reduced length checking sequence by connecting the el...
متن کاملReducing the Lengths of Checking Sequences by Overlapping
There are two main shortcomings in the existing models for generating checking sequences based on distinguishing sequences. First, these models require a priori selection of state recognition sequences (called αsequences) which may not be the best selection for yielding substantial reduction in the length of checking sequences. Second, they do not take advantage of overlapping to further reduce...
متن کاملReduced checking sequences using unreliable reset
The length of a checking sequence (CS) generated from a deterministic, minimal, and completely specified finite state machine model M of a system under test which does not have a reliable reset feature, is exponential when M does not have a distinguishing sequence. This is due to the exponential length locating sequences that need to be used in such a CS. In this work, we propose a method to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 51 شماره
صفحات -
تاریخ انتشار 2002